|
A kinetic data structure is a data structure used to track an attribute of a geometric system that is moving continuously.〔 〕〔 〕〔 〕 For example, a kinetic convex hull data structure maintains the convex hull of a group of moving points. The development of kinetic data structures was motivated by computational geometry problems involving physical objects in continuous motion, such as collision or visibility detection in robotics, animation or computer graphics. ==Overview== Kinetic data structures are used on systems where there is a set of values that are changing as a function of time, in a known fashion. So the system has some values, and for each value , it is known that . Kinetic data structures allow queries on a system at the current virtual time , and two additional operations: *: Advances the system to time . *: Alters the trajectory of value to , as of the current time. Additional operations may be supported. For example, kinetic data structures are often used with a set of points. In this case, the structure typically allows points to be inserted and deleted. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「kinetic data structure」の詳細全文を読む スポンサード リンク
|